Tree-decompositions, tree-representability and chordal graphs
نویسندگان
چکیده
منابع مشابه
Tree decompositions and social graphs
Recent work has established that large informatics graphs such as social and information networks have a nontrivial treelike structure when viewed at moderate-size scales. Here, we present results from the first detailed empirical evaluation of the use of tree decomposition (TD) heuristics for structure identification and extraction in social graphs. Although TDs have historically been used in ...
متن کاملRecoloring graphs via tree decompositions
Let k be an integer. Two vertex k-colorings of a graph are adjacent if they differ on exactly one vertex. A graph is k-mixing if any proper k-coloring can be transformed into any other through a sequence of adjacent proper k-colorings. Jerrum proved that any graph is k-mixing if k is at least the maximum degree plus two. We first improve Jerrum’s bound using the grundy number, which is the wors...
متن کاملSimplicial tree-decompositions of infinite graphs, I
This paper is intended as an introduction to the theory of simplicial decompositions of graphs. It presents, in a unified way, new results as well as some basic old ones (with new proofs). Its main result is a structure theorem for infinite graphs with a simplicial tree-decomposition into primes. The existence and uniqueness of such prime decompositions will be investigated in two subsequent pa...
متن کاملAlgorithms Finding Tree-Decompositions of Graphs
A graph G has tree-width at most w if it admits a tree-decomposition of width ≤ w. It is known that once we have a tree-decomposition of a graph G of bounded width, many NP -hard problems can be solved for G in linear time. For w ≤ 3 we give a lineartime algorithm for finding such a decomposition and for a general fixed w we obtain a probabilistic algorithm with execution time O(n log n+ n logn...
متن کاملCompression of Probabilistic Graphs using Tree Decompositions
Probabilistic graphs are a natural model for uncertainty in networks, such as biological, social, road, and communication networks. There has been much recent research in query processing on such graphs, mainly via sampling-based algorithms, yet proposed techniques still have significant costs in terms of execution time. In this paper, we present an alternative approach to the processing of pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1988
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90071-4